Local-Search Heuristics for Generative Planning
نویسنده
چکیده
Local-search approaches promise very interesting features for planning, such as an anytime computation and an uncomplicated handling of the environment’s dynamics. However, most local-search approaches require the availability of maximal structures what causes problems of scalability. Local search within a generative planning process is rarely looked into. This article presents some basic heuristics for generative planning, and demonstrates the approaches’ capabilities by way of solving variations of combined planning and scheduling in the Logistics Domain.
منابع مشابه
Local Search Heuristsics for Generative Planning
Local-search approaches promise very interesting features for planning, such as an anytime computation and an uncomplicated handling of the environment's dynamics. However, most local-search approaches require the availability of maximal structures what causes problems of scalability. Local search within a generative planning process is rarely looked into. This article presents some basic heuri...
متن کاملA discrete particle swarm optimization algorithm with local search for a production-based two-echelon single-vendor multiple-buyer supply chain
This paper formulates a two-echelon single-producer multi-buyer supply chain model, while a single product is produced and transported to the buyers by the producer. The producer and the buyers apply vendor-managed inventory mode of operation. It is assumed that the producer applies economic production quantity policy, which implies a constant production rate at the producer. The operational pa...
متن کاملPlanning Acquisitions for an Ocean Global Surveillance Mission
In this paper, we present the problem of planning the acquisitions performed by a constellation of radar satellites in order to fulfil as well as possible an ocean global surveillance mission. Then, we describe the local search algorithm, inspired by large neighborhood search techniques and knapsack heuristics, that has been specifically designed and implemented to solve daily planning problem ...
متن کاملGlobal Heuristics for Distributed Cooperative Multi-Agent Planning
Almost every planner needs good heuristics to be efficient. Heuristic planning has experienced an impressive progress over the last years thanks to the emergence of more and more powerful estimators. However, this progress has not been translated to multi-agent planning (MAP) due to the difficulty of applying classical heuristics in distributed environments. The application of local search heur...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کامل